Generality Explained
نویسندگان
چکیده
What explains the truth of a universal generalization? Two types explanation can be distinguished. While an ‘instance-based explanation’ proceeds via some or all instances generalization, ‘generic is independent instances, relying instead on completely general facts about properties operations involved in generalization. This intuitive distinction analyzed by means truthmaker semantics, which also sheds light correct logic quantification. On most natural version this analysis vindicates claims made—without proper defense—by Michael Dummett, Solomon Feferman, and others. Where instance-based explanations are freely available, classical shown to warranted. By contrast, intuitionistic (or slightly more) remains warranted regardless what available.
منابع مشابه
Indecisive Generality
When a project fails to clarify important issues, to complete the analysis, or to make clear statements where the system is meant to be extensible and where it needs to be stable, architects tend to answer the indecisiveness in a technical way: general and complex solutions. This diagnosis pattern is about the balance between making decisions and introducing variability and configurability. It ...
متن کاملGenerality: A New Criterion for Measuring Generality of Documents
Most information retrieval systems, including Web search engines, use similarity ranking algorithms based on a vector space model to find relevant information in response to a user’s request. However, the retrieved information is frequently irrelevant, because most of the current information systems employ index terms or other techniques that are variants of term frequency. In this paper, we pr...
متن کاملWithout Loss of Generality
One sometimes reads in a mathematical proof that a certain assumption can be made ‘without loss of generality’ (WLOG). In other words, it is claimed that considering what first appears only a special case does nevertheless suffice to prove the general result. Typically the intuitive justification for this is that one can exploit symmetry in the problem. We examine how to formalize such ‘WLOG’ a...
متن کاملGenerality and Computational Cost
The purpose of this note is pedagogi-cal. It discusses how one can reduce the computational cost of applying a set of operators (or predicates) by breaking them up into combinations of commonly occurring, simpler ones. This can be thought of as a process of generalization, in the sense that the common, simple operators are more "general" than the original, more complex ones. We are thus suggest...
متن کاملThe Generality of Overgenerality
Several recent papers Cohen, 1990c; Flann and Dietterich, 1989] have presented learning systems that use, as background knowledge, an initial domain theory that is overgeneral: that is, a theory that deenes a concept that is a superset of the concept to be learned. Learning then becomes a problem of specializing the initial theory. Such an overgeneral theory is, of course, only one of many poss...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Philosophy
سال: 2022
ISSN: ['0022-362X', '1939-8549']
DOI: https://doi.org/10.5840/jphil2022119725